BOOTSTRAPPING DENSITY-WEIGHTED AVERAGE DERIVATIVES
نویسندگان
چکیده
منابع مشابه
Bootstrapping Weighted Fourier Inequalities
is finite. The purpose of this paper is to provide a framework for proving inequalities of the form (1). The idea is to exploit the close relationship of the Fourier transform to the operation of convolution and then to apply techniques from the theory of positive integral operators. Although the convolution operators that arise are not necessarily positive, they are trivially majorized by posi...
متن کاملFast Implementation of Density-Weighted Average Derivative Estimation
Given random variables X ∈ IR and Y such that E[Y |X = x] = m(x), the average derivative δ0 is defined as δ0 = E[∇m(X)], i.e., as the expected value of the gradient of the regression function. Average derivative estimation has several applications in econometric theory (Stoker, 1992) and thus it is crucial to have a fast implementation of this estimator for practical purposes. We present such a...
متن کاملOptimistic Fuzzy Weighted Average
− The fuzzy weighted average (FWA) is used in many engineering problems where aggregation of fuzzy information is dealt with. In this framework, many algorithms have been proposed to compute efficiently the FWA according to Zadeh's extension principle. However, due to fuzzy interval calculus, the exact solution presents a characteristic that may be viewed as an important drawback. Indeed, repla...
متن کاملFuzzy Weighted Average - Analytical Solution
An algorithm is presented for the computation of analytical expressions for the extremal values of the α-cuts of the fuzzy weighted average, for triangular or trapeizoidal weights and attributes. Also, an algorithm for the computation of the inverses of these expressions is given, providing exact membership functions of the fuzzy weighted average. Up to now, only algorithms exist for the comput...
متن کاملAverage distance in weighted graphs
Let G be a given connected graph on n vertices. Suppose N facilities are located in the vertices of the graph. We consider the expected distance between two randomly chosen facilities. This is modelled by the following definition: Let G be a connected graph and let each vertex have weight c(v). The average distance of G with respect to c is defined as µ c (G) = N 2 −1 {u,v}⊆V (G) d G (u, v), wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Econometric Theory
سال: 2014
ISSN: 0266-4666,1469-4360
DOI: 10.1017/s0266466614000127